Queueing performance improvement with random order dispersion
نویسنده
چکیده
This paper analytically studies queueing performance improvement with traffic dispersion. We model sources and paths between sources and destinations as generalized binary Markov sources and discrete-time queues, respectively. We suppose that random order dispersion is employed in packet network, and we examine the effect of random order dispersion on the asymptotic tail distribution of the queue length of packets. Numerical results exhibit that traffic dispersion can improve the queueing performance of packets.
منابع مشابه
Analysis of M/G/ 1 queueing model with state dependent arrival and vacation
This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a fixed duration or may continue to be available in the system for next service. Using the probability argument, we construct the ...
متن کاملA Free Access DQRAP for a Broadcast Channel1
DQRAP (Distributed Queueing Random Access Protocol) is a random multiple access protocol for a slotted broadcast channel, shared by an infinite number of stations with bursty traffic, which can achieve a performance approaching that of a hypothetical perfect scheduling protocol (i.e. M/D/1 system). The Free Access DQRAP (FADQRAP) is an easy-to-implement version of DQRAP. FADQRAP, as does DQRAP,...
متن کاملPerformance evaluation for DRED discrete-time queueing network analytical model
Due to the rapid development in computer networks, congestion becomes a critical issue. Congestion usually occurs when the connection demands on network resources, i.e. buffer spaces, exceed the available ones. We propose in this paper a new discrete-time queueing network analytical model based on dynamic random early drop (DRED) algorithm to control the congestion in early stages. We apply our...
متن کاملReducing subtask dispersion in parallel queueing systems
In various real-world parallel processing systems, incoming tasks divide into several subtasks that are processed independently by parallel servers. Queueing networks are a natural way to represent the ow and processing of tasks and subtasks in such systems. Two useful classes of queueing network representations are split-merge and fork-join systems. There are two main metrics of interest in th...
متن کاملCapacity planning in the hospital queueing network with blocking: simulation-based optimization approach
Introduction: Hospital administrators have always faced the challenge of providing the best possible health services in a resource-limited environment. The patient flow throughout the hospital is affected by lack of the capacities that can lead to bed-blocking among the hospital units. In this research, the patient flow in the hospital is modeled as an open queueing network with blocking. Then,...
متن کامل